Developing Backward Chaining Algorithm of Inference Engine in Ternary Grid Expert System
نویسندگان
چکیده
منابع مشابه
Developing Backward Chaining Algorithm of Inference Engine in Ternary Grid Expert System
The inference engine is one of main components of expert system that influences the performance of expert system. The task of inference engine is to give answers and reasons to users by inference the knowledge of expert system. Since the idea of ternary grid issued in 2004, there is only several developed method, technique or engine working on ternary grid knowledge model. The in 2010 developed...
متن کاملSequence-Learning Algorithm Based on Backward Chaining
This article considers the problem of learning the correct temporal sequence of discrete behaviors from a finite behavior set that will lead to completion of a complex task, using only stochastic reinforcement from the environment. A trial-and-error learning algorithm is proposed that is inspired by backward chaining from the animal training discipline. The procedure is analytically formulated ...
متن کاملA Causal Knowledge-Driven Inference Engine for Expert System
A wide variety of knowledge acquisition methods exist for conventional knowledge types such as production rule, semantic knowledge, etc. However, need for causal knowledge acquisition has not been stressed in the expert systems fields. The objectives of this paper are to (1) suggest a causal knowledge acquisition process and (2) investigate the causal knowledge-based inference process. FCM (Fuz...
متن کاملBackward chaining rule induction
Exploring the vast number of possible feature interactions in domains such as gene expression microarray data is an onerous task. We describe Backward-Chaining Rule Induction (BCRI) as a semi-supervised mechanism for biasing the search for IF-THEN rules that express plausible feature interactions. BCRI adds to a relatively limited tool-chest of hypothesis generation software and is an alternati...
متن کاملBackward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)—tournament selection—we highlight a previously-unknown source of inefficiency. This leads us to rethink the order in which operations are performed within EAs, and to suggest an algorithm—the EA with efficient macro-selection—that avoids the inefficiencies associated with tournament selection. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2012
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2012.030937